https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 A bucket indexed formulation for nonpreemptive single machine scheduling problems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:24718 bucket indexed (BI) model, partitions the planning horizon into periods of equal length, or buckets. Unlike the TI model, the length of a period is a parameter of the BI model and can be chosen to be as long as the processing time of the shortest job. The two models are equivalent if a period is of unit length, but when longer periods are used in the BI model, it can have significantly fewer variables and nonzeros than the corresponding TI model. A computational study using weighted tardiness instances, and weighted completion time instances with release dates, reveals that the BI model significantly outperforms the TI model on instances where the minimum processing time of the jobs is large. Furthermore, the performance of the BI model is less vulnerable to increases in average processing time when the ratio of the largest processing time to the smallest is held constant.]]> Tue 27 Mar 2018 15:15:29 AEDT ]]> Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12554 Sat 24 Mar 2018 08:17:33 AEDT ]]> Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12603 Sat 24 Mar 2018 08:17:28 AEDT ]]> An automated intensity-modulated radiation therapy planning system https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12599 Sat 24 Mar 2018 08:17:27 AEDT ]]> Branch-and-price guided search for integer programs with an application to the multicommodity fixed-charge network flow problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12829 Sat 24 Mar 2018 08:17:16 AEDT ]]> A new sequential extraction heuristic for optimizing the delivery of cancer radiation treatment using multileaf collimators https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12827 Sat 24 Mar 2018 08:17:16 AEDT ]]> The fixed-charge shortest-path problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12543 e for using arc e, an interval [le, ue] (le, ue ∈ ℤ) specifying the range of allowable resource consumption quantities along arc e, and a per-unit cost ce for resource consumed along e. Furthermore, for each node n ∈ N, let Un ∈ ℤ be the maximum amount of resource consumption a path can accumulate before visiting node n. Given a source node ns ∈ N and sink node nt ∈ N, the fixed-charge shortest-path problem (FCSPP) seeks to find a minimum-cost-feasible path from ns to nt . When resource consumption is simply additive, the resource-constrained shortest-path problem (RCSPP) is a special case of FCSPP. We develop a new dynamic programming algorithm for FCSPP. The algorithm uses solutions from labeling and dominance techniques for standard RCSPPs on slightly modified problems, and it combines these solutions by exploiting the structure provided by certain classes of knapsack problems to efficiently construct an optimal solution to FCSPP. Computational experiments demonstrate that our algorithm is often several orders of magnitude faster than naive dynamic programming procedures.]]> Sat 24 Mar 2018 08:17:04 AEDT ]]> Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12840 Sat 24 Mar 2018 08:15:24 AEDT ]]> A criterion space search algorithm for biobjective integer programming: the balanced box method https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:22582 Sat 24 Mar 2018 07:15:58 AEDT ]]> A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:23395 Sat 24 Mar 2018 07:13:56 AEDT ]]>